A Simplicial Continuation Direct Search
نویسنده
چکیده
A direct search method for the class of problems considered by Lewis and Torczon [SIAM J. Optim., 12 (2002), pp. 1075-1089] is developed. Instead of using an augmented Lagrangian method, a simplicial approximation method to the feasible set is implicitly employed. This allows the points our algorithm considers to conveniently remain within an a priori specified distance of the feasible set. In the limit, a positive spanning set is constructed in the tangent plane to the feasible set of every cluster point. In this way, we can guarantee that every cluster point is a stationary point for the objective function restricted to the feasible set.
منابع مشابه
Calculating Simplicial Localizations*
1.1. Summary. This paper is essentially a continuation of [3], where we introduced a (standard) simplicial localization functor, which assigned to every category C and subcategory W c C, a simpficiaf category LC with in each dimension the same objects as C (i.e. for every two objects X, YE C, the maps X -+ YE LC form a simplicial set LC(X, Y)). This simplicial localization has all kinds of nice...
متن کاملSimplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions
In this second of three papers on the same subject we obtain a first characterization of the countable graphs that admit a simplicial tree-decomposition into primes. This paper is a continuation of [ 4 ]. The problem it tackles, the existence of simplicial tree-decompositions into primes, was introduced in [ 4 ], and all the notation used is explained there. To repeat just the most basic defini...
متن کاملSimplicial Dijkstra and A* Algorithms: From Graphs to Continuous Spaces
This paper considers the optimal feedback planning problem of a point robot among polygonal obstacles in R. In this problem the Euclidean distance traveled by the robot is minimized. The approximate optimal feedback plan is computed using a piecewise linear approximation of the costto-go function. The approximate cost-to-go function, in turn, satisfies the discrete version of dynamic programmin...
متن کاملSimplicial diffeomorphisms
In this paper we will present a theory for simplicial diffeomorphims, that is, diffeomorphims that preserve the incidence relations of a simplicial complex. Simplicial diffeomorphisms can be regarded as curvilinear barycentric coordinates. Using the combination of piecewise linear functions on complexes with simplicial diffeomorphisms, we also propose a new representation of curves and surfaces...
متن کاملInstituto de Matemática Pura e Aplicada Simplicial
In this paper we will develop a theory for simplicial diffeomorphims, that is, diffeomorphims that preserve the incidence relations of a simplicial complex, and analyze alternative schemes to construct them with different properties. In combining piecewise linear functions on complexes with simplicial diffeomorphisms, we propose a new representation of curves and surfaces (and hypersurfaces, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007